Spatial area determination problem: Definition and solution method based on Memetic Algorithm
نویسندگان
چکیده
Spatial area determination problem is defined herein as an optimization in which it required to determine both the location and shape of a spatial area, given some constraints on (e.g., size) while maximizing or minimizing objective function data risk, cost, safety, security, etc.). The can be found various domains such hydrographic survey planning, conservation military etc., recently attracts research attention. Currently, there no formal definition related solution methods are very limited. In this paper, first, formulated, then method based Memetic Algorithm developed solve problem. To deal with enhance robustness traditional Algorithm, several innovations proposed introduced. Unlike employs three crossover operators, two mutation local search operator. addition, has mechanism automatically restart its process if gets stuck optima. Moreover, parameters systematically tuned by Taguchi experimental design maximize performance. outperformance validated through 18 test instances, 24 T-tests, Friedman against four popular algorithms, namely Simulated Annealing, Particle Swarm Optimization, Genetic Algorithm. results indicate that, average, provided 36.5%, 43.3%, 20.4%, 22.4% better solution, compared respectively.
منابع مشابه
SOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملA multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Memetic Algorithm for Minimum Energy Broadcast Problem
A heuristic memetic algorithm for the minimum energy broadcasting problem in wireless ad hoc networks is discussed in this chapter. Broadcasting in wireless networks is different from broadcasting in wired networks because every node in wireless networks is equipped with omnidirectional antennas and several nodes are covered in a single transmission. Each node within the transmission range of t...
متن کاملImproving the Solution of Traveling Salesman Problem Using Genetic, Memetic Algorithm and Edge assembly Crossover
The Traveling salesman problem (TSP) is to find a tour of a given number of cities (visiting each city exactly once) where the length of this tour is minimized. Testing every possibility for an N city tour would be N! Math additions. Genetic algorithms (GA) and Memetic algorithms (MA) are a relatively new optimization technique which can be applied to various problems, including those that are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Soft Computing
سال: 2022
ISSN: ['1568-4946', '1872-9681']
DOI: https://doi.org/10.1016/j.asoc.2022.109243